Stability for Properly Quasiconvex Vector Optimization Problem
نویسندگان
چکیده
The aim of this paper is to study the stability aspects of various types of solution set of a vector optimization problem both in the given space and in its image space by perturbing the objective function and the feasible set. The Kuratowski– Painlevé set-convergence of the sets of minimal, weak minimal and Henig proper minimal points of the perturbed problems to the corresponding minimal set of the original problem is established assuming the objective functions to be (strictly) properly quasi cone-convex.
منابع مشابه
The inexact projected gradient method for quasiconvex vector optimization problems
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is important to have practical solution approaches for computing. In this work, we consider the inexact projected gradient-like method for solving smooth constra...
متن کاملWell-posedness and scalarization in vector optimization
In this paper we study several existing notions of well-posedness for vector optimization problems. We distinguish them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are ...
متن کاملExtremal properties of generalized convex vector-valued functions
It is known that any local maximizer of an explicitly quasiconvex realvalued function is actually a global minimizer, whenever it belongs to the intrinsic core of the function’s domain. We show that a similar property holds for componentwise explicitly quasiconvex vector-valued functions, with respect to the optimality concepts of ideal, strong and weak efficiency. These new results are applied...
متن کاملSecond-order optimality and duality in vector optimization over cones
In this paper, we introduce the notion of a second-order coneconvex function involving second-order directional derivative. Also, second-order cone-pseudoconvex, second-order cone-quasiconvex and other related functions are defined. Second-order optimality and Mond-Weir type duality results are derived for a vector optimization problem over cones using the introduced classes of functions.
متن کاملOn duality in nonconvex vector optimization in Banach spaces using augmented Lagrangians
This paper shows how the use of penalty functions in terms of projections on the constraint cones, which are orthogonal in the sense of Birkhoff, permits to establish augmented Lagrangians and to define a dual problem of a given nonconvex vector optimization problem. Then the weak duality always holds. Using the quadratic growth condition together with the inf-stability or a kind of Rockafellar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Optimization Theory and Applications
دوره 155 شماره
صفحات -
تاریخ انتشار 2012